Towards Efficient Information-Theoretic Function Secret Sharing

Non-Interactive and Information-Theoretic Secure Publicly Verifiable Secret Sharing

A publicly verifiable secret sharing scheme is more applicable than a verifiable secret sharing because of the property that the validity of the shares distributed by the dealer can be verified by any party. In this paper, we construct a non-interactive and informationtheoretic publicly verifiable secret sharing by a computationally binding and unconditionally hiding commitment scheme and zero-...

Timed-Release Secret Sharing Schemes with Information Theoretic Security

In modern cryptography, the secret sharing scheme is an important cryptographic primitive and it is used in various situations. In this paper, a timed-release secret sharing scheme (TR-SS) with information-theoretic security is first studied. TRSS is a secret sharing scheme with the property that participants more than a threshold number can reconstruct a secret by using their shares only when ...

Timed-Release Secret Sharing Scheme with Information Theoretic Security

In modern cryptography, the secret sharing scheme is an important cryptographic primitive and it is used in various situations. In this paper, a timed-release secret sharing scheme (TR-SS) with information-theoretic security is first studied. TRSS is a secret sharing scheme with the property that participants more than a threshold number can reconstruct a secret by using their shares only when ...

Secure Multiparty Computation and Secret Sharing - An Information Theoretic Appoach

Space Efficient Secret Sharing

A k-out-of-n secret sharing scheme conventionally encodes a single secret s in n shares such that any k of them can be used to reconstruct the secret (Shamir’s scheme [1]). However, Shamir’s scheme is not space efficient because it leads to a n-fold increase in total storage requirement. Some efforts have been made to create space efficient schemes [5, 6] under certain restrictions, but most ot...